Automating Soundness Proofs
نویسنده
چکیده
When developing a new language with semantics described by Structural Operational Semantics (SOS), one often wants an axiomatisation of this language (w.r.t. to some equivalence) as well. We describe a method for automating the straightforward soundness proofs for the axioms of such an axiomatisation.
منابع مشابه
Using Vampire in Soundness Proofs of Type Systems
Type systems for programming languages shall detect type errors in programs before runtime. To ensure that a type system meets this requirement, its soundness must be formally verified. We aim at automating soundness proofs of type systems to facilitate the development of sound type systems for domain-specific languages. Soundness proofs for type systems typically require induction. However, ma...
متن کاملAutomating Proof Steps of Progress Proofs: Comparing Vampire and Dafny
Developing provably sound type systems is a non-trivial task which, as of today, typically requires expert skills in formal methods and a considerable amount of time. Our Veritas [3] project aims at providing support for the development of soundness proofs of type systems and efficient type checker implementations from type system specifications. To this end, we investigate how to best automate...
متن کاملAutomating Type Soundness Proofs via Decision Procedures and Guided Reductions
Operational models of fragments of the Java Virtual Machine and the .NET Common Language Runtime have been the focus of considerable study in recent years, and of particular interest have been specifications and machine-checked proofs of type soundness. In this paper we aim to increase the level of automation used when checking type soundness for these formalizations. We present a semi-automate...
متن کاملA tool for automating the computationally complete symbolic attacker ( Extended Abstract )
The design of automated security proofs is a topic extensively studied for over 20 years. One problem that was raised about 12 years ago is the validity (or the scope) of such proofs. Symbolic models are quite far from the implementation. In contrast, modern cryptography typically considers more powerful attackers. This includes of course some computations that are not explicitly specified. Thi...
متن کاملAbstract Notions and Inference Systems for Proofs by Mathematical Induction
Notions and Inference Systems for Proofs by Mathematical Induction Claus-Peter Wirth? and Klaus Becker Fb. Informatik, Universität Kaiserslautern, D-67663, Germany {wirth, klbecker}@informatik.uni-kl.de Abstract. Soundness of inference systems for inductive proofs is sometimes Soundness of inference systems for inductive proofs is sometimes shown ad hoc and a posteriori, lacking modularization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 229 شماره
صفحات -
تاریخ انتشار 2009